Large deviations, Basic information theorem for fitness preferential attachment random networks
نویسندگان
چکیده
For fitness preferential attachment random networks, we define the empirical degree and pair measure, which counts the number of vertices of a given degree and the number of edges with given fits, and the sample path empirical degree distribution. For the empirical degree and pair distribution for the fitness preferential attachment random networks, we find a large deviation upper bound. From this result we obtain a weak law of large numbers for the empirical degree and pair distribution, and the basic information theorem or an asymptotic equipartition property for fitness preferential attachment random networks.
منابع مشابه
Basic models and questions in statistical network analysis
Extracting information from large graphs has become an important statistical problem since network data is now common in various fields. In this minicourse we will investigate the most natural statistical questions for three canonical probabilistic models of networks: (i) community detection in the stochastic block model, (ii) finding the embedding of a random geometric graph, and (iii) finding...
متن کاملRecency-based preferential attachment models
Preferential attachment models were shown to be very effective in predicting such important properties of real-world networks as the power-law degree distribution, small diameter, etc. Many different models are based on the idea of preferential attachment: LCD, Buckley-Osthus, Holme-Kim, fitness, random Apollonian network, and many others. Although preferential attachment models reflect some im...
متن کاملPAFit: an R Package for Estimating Preferential Attachment and Node Fitness in Temporal Complex Networks
Many real-world systems are profitably described as complex networks that grow over time. Preferential attachment and node fitness are two ubiquitous growth mechanisms that not only explain certain structural properties commonly observed in real-world systems, but are also tied to a number of applications in modeling and inference. In the node fitness mechanism, the probability a node acquires ...
متن کاملA Geometric Preferential Attachment Model of Networks
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, x2, . . . , xn chosen uniformly at random from the unit sphere in R . After generating xt, we randomly connect it to m points from those points in x1, x2, . . . , xt−1 which are within distance r. Neighbors are chosen ...
متن کاملJoint estimation of preferential attachment and node fitness in growing complex networks
Complex network growth across diverse fields of science is hypothesized to be driven in the main by a combination of preferential attachment and node fitness processes. For measuring the respective influences of these processes, previous approaches make strong and untested assumptions on the functional forms of either the preferential attachment function or fitness function or both. We introduc...
متن کامل